Principal Typing for Lambda Calculus in Elementary Affine Logic
نویسندگان
چکیده
Elementary Affine Logic (EAL) is a variant of Linear Logic characterizing the computational power of the elementary bounded Turing machines. The EAL Type Inference problem is the problem of automatically assigning to terms of λ-calculus EAL formulas as types. This problem, restricted to the propositional fragment of EAL, is proved to be decidable, and an algorithm is shown, building, for every λ-term, either a negative answer or a finite set of type schemata, from which all and only its typings can be derived, through suitable operations.
منابع مشابه
Principal Typing in Elementary Affine Logic
Elementary Affine Logic (EAL) is a variant of the Linear Logic characterizing the computational power of the elementary bounded Turing machines. The EAL Type Inference problem is the problem of automatically assign to terms of λ-calculus EAL formulas as types. The problem is solved by showing that every λ-term which is typeable has a finite set of principal typing schemata, from which all and o...
متن کاملTyping and Optimal reduction for λ-calculus in variants of Linear logic for Implicit computational complexity
Lambda-calculus has been introduced to study the mathematical functions from a computa-tional point of view. It has then been used as a basis for the design of functional programminglanguages. Knowing whether there exists a provably most efficient method to reduce lambda-terms, and evaluate the complexity of this operation in general are still open questions.In this thesis, we u...
متن کاملElementary Affine Logic and the Call-by-Value Lambda Calculus
Light and elementary linear logics have been introduced as logical systems enjoying quite remarkable normalization properties. Designing a type assignment system for pure lambda calculus from these logics, however, is problematic, as discussed in [1]. In this paper, we show that shifting from usual call-by-name to call-by-value lambda calculus allows to regain strong connections with the underl...
متن کاملVerification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
In a previous work we introduced Dual Light Affine Logic (DLAL) ([BT04]) as a variant of Light Linear Logic suitable for guaranteeing complexity properties on lambda-calculus terms: all typable terms can be evaluated in polynomial time and all Ptime functions can be represented. In the present work we address the problem of typing lambda-terms in second-order DLAL. For that we give a procedure ...
متن کاملExecution Time of Lambda-Terms via Non Uniform Semantics and Intersection Types
The relational semantics for Linear Logic induces a semantics for the type free Lambda Calculus. This one is built on non-idempotent intersection types. We give a principal typing property for this type system.We then prove that the size of the derivations is closely related to the execution time of lambda-terms in a particular environment machine, Krivine’s machine.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 65 شماره
صفحات -
تاریخ انتشار 2005